Estimation, Filtering, and Smoothing in State Space Models with Incompletely Specified Initial Conditions
نویسندگان
چکیده
منابع مشابه
State Reduction in Incompletely Specified Finite-State Machines
The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques-state assignment to the DON'T CARE entries, and so-called "state splitting"-are investigated. For both of the tech...
متن کاملSmoothing Algorithms for State-Space Models
A prevalent problem in statistical signal processing, applied statistics, and time series analysis is the calculation of the smoothed posterior distribution, which describes the uncertainty associated with a state, or a sequence of states, conditional on data from the past, the present, and the future. The aim of this paper is to provide a rigorous foundation for the calculation, or approximati...
متن کاملSequential Monte Carlo smoothing with application to parameter estimation in non-linear state space models
This paper concerns the use of Sequential Monte Carlo methods (SMC) for smoothing in general state space models. A well known problem when applying the standard SMC technique in the smoothing mode is that the resampling mechanism introduces degeneracy of the approximation in the path-space. However, when performing maximum likelihood estimation via the EM algorithm, all involved functionals wil...
متن کاملBayesian Estimation of State Space Models Using Moment Conditions∗
We consider Bayesian estimation of state space models when the measurement density is not available but estimating equations for the parameters of the measurement density are available from moment conditions. The most common applications are partial equilibrium models involving moment conditions that depend on dynamic latent variables (e.g., timevarying parameters, stochastic volatility) and dy...
متن کاملIncompletely specified probabilistic networks
Probabilistic networks, used as an adjunci or alternative to the logzcal models used in AI and DSS, ogler a way to compactly represent a distribution over a set of random variables. Nonetheless, the specification of a given network may require conditional probabilities which are simply unavailable. In this paper a means for analyzing incompletely specified networks is presented, and some genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1985
ISSN: 0090-5364
DOI: 10.1214/aos/1176349739